The even adjacency split problem for graphs
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولThe Even Cycle Problem for Directed Graphs
If each arc in a strongly connected directed graph of minimum in-degree and outdegree at least 3 is assigned a weight 0 or 1, then the resultingweighted directed graph has a directed cycle of even total weight. This provesa conjecture made by L. Lovasz in 1975 and has applications to colour-criticalhypergraphs, sign-nonsingular matrices, and permanents of matrices. MATHEMATICAL ...
متن کاملAn Extremal Problem For Random Graphs And The Number Of Graphs With Large Even-Girth
We study the maximal number of edges a C2k-free subgraph of a random graph Gn;p may have, obtaining best possible results for a range of p = p(n). Our estimates strengthen previous bounds of F uredi 12] and Haxell, Kohayakawa, and Luczak 13]. Two main tools are used here: the rst one is an upper bound for the number of graphs with large even-girth, i.e., graphs without short even cycles, with a...
متن کاملAdjacency posets of planar graphs
In this paper, we show that the dimension of the adjacency poset of a planar graph is at most 8. From below, we show that there is a planar graph whose adjacency poset has dimension 5. We then show that the dimension of the adjacency poset of an outerplanar graph is at most 5. From below, we show that there is an outerplanar graph whose adjacency poset has dimension 4. We also show that the dim...
متن کاملCommutativity of the adjacency matrices of graphs
We say that two graphs G1 and G2 with the same vertex set commute if their adjacency matrices commute. In this paper, we find all integers n such that the complete bipartite graph Kn, n is decomposable into commuting perfect matchings or commuting Hamilton cycles. We show that there are at most n−1 linearly independent commuting adjacency matrices of size n; and if this bound occurs, then there...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2000
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(99)00183-3